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 listMar 21, 2026 09:09Dominique GarmierDominique GarmierScore: 458,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 09:07457,7793,827,058,5603,798,569,000999,0002,486,272
2Mar 21, 2026 09:07458,0923,823,030,9033,801,165,000999,0002,469,888
3Mar 21, 2026 09:09458,1233,829,723,4643,801,421,000999,0002,527,232
4Mar 21, 2026 09:09458,2183,833,510,3503,802,210,000999,0002,527,232
5Mar 21, 2026 09:09458,2723,831,852,4723,801,659,0001,998,0002,269,184
6Mar 21, 2026 09:07458,2933,830,140,3983,801,834,0001,998,0002,269,184