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 26, 2026 12:24TudyMTudyMScore: 58,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 12:2458,959508,481,250488,363,0001,000,0002,310,144
2Apr 26, 2026 12:2458,962506,633,090488,392,0001,000,0002,371,584
3Apr 26, 2026 12:2458,974505,836,728488,489,0001,001,0002,367,488
4Apr 26, 2026 12:2458,974509,846,623487,491,0001,997,0002,375,680
5Apr 26, 2026 12:2458,975508,850,987487,496,0001,997,0002,367,488
6Apr 26, 2026 12:2458,975506,830,344487,496,0001,997,0002,367,488
7Apr 26, 2026 12:2458,977504,237,354487,518,0001,998,0002,355,200
8Apr 26, 2026 12:2458,979506,774,504487,534,0001,998,0002,293,760
9Apr 26, 2026 12:2458,979508,772,088487,535,0001,998,0002,375,680