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 listJul 4, 2026 00:20zielajzielajScore: 3,334Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:203,31035,432,17426,430,0001,045,0002,113,536
2Jul 4, 2026 00:203,31535,446,30126,442,0001,076,0002,113,536
3Jul 4, 2026 00:203,31635,491,34626,472,0001,051,0002,113,536
4Jul 4, 2026 00:203,31635,388,79626,460,0001,065,0002,113,536
5Jul 4, 2026 00:203,33435,577,09226,596,0001,081,0002,113,536
6Jul 4, 2026 00:203,37435,890,13126,936,0001,076,0002,113,536
7Jul 4, 2026 00:203,38736,057,43827,029,0001,084,0002,113,536
8Jul 4, 2026 00:203,41144,465,09727,251,0001,067,0002,113,536
9Jul 4, 2026 00:203,42136,355,44827,339,0001,062,0002,113,536