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 listFeb 3, 2026 22:22RuszrokRuszrokScore: 16,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 22:2216,241163,443,359132,802,0001,997,0002,293,760
2Feb 3, 2026 22:2216,269159,017,800134,030,0001,000,0002,277,376
3Feb 3, 2026 22:2216,322165,606,641134,469,0001,003,0002,265,088
4Feb 3, 2026 22:2216,330162,241,395134,532,0001,003,0002,523,136
5Feb 3, 2026 22:2216,857166,970,616137,918,0001,998,0002,519,040
6Feb 3, 2026 22:2217,035167,782,040140,390,0001,002,0002,293,760