Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listApr 6, 2026 11:15Danylo MocherniukDanylo MocherniukScore: 8,048Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 11:158,02493,113,84765,589,0001,009,0002,506,752
2Apr 6, 2026 11:158,02897,318,60765,627,0001,009,0002,293,760
3Apr 6, 2026 11:158,03293,933,80064,649,0002,020,0002,293,760
4Apr 6, 2026 11:158,04893,772,41465,799,000996,0002,293,760
5Apr 6, 2026 11:158,05191,328,11664,826,0001,994,0002,510,848
6Apr 6, 2026 11:158,05499,857,59265,853,000997,0002,502,656