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 listSep 8, 2026 00:45Victor MerckléVictor MerckléScore: 56,347Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 00:4754,434460,929,119429,451,00022,355,0002,121,728stderr
2Sep 8, 2026 00:4754,790463,085,922429,941,00024,819,0002,121,728stderr
3Sep 8, 2026 00:4755,416468,850,252428,794,00031,166,00028,672stderr
4Sep 8, 2026 00:4756,210475,056,578431,534,00035,016,00028,672stderr
5Sep 8, 2026 00:4756,347476,194,748431,463,00036,218,00028,672stderr
6Sep 8, 2026 00:4761,606520,624,106428,623,00082,714,00028,672stderr
7Sep 8, 2026 00:4766,765562,697,946441,469,000112,682,00028,672stderr
8Sep 8, 2026 00:4770,182591,812,124442,102,000140,409,00028,672stderr
9Sep 8, 2026 00:4774,495627,691,217451,176,000167,138,00028,672stderr