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 listOct 25, 2026 18:00timothygktimothygkScore: 15,434Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2026 18:0515,209137,925,30681,287,00044,954,0002,121,728stderr
2Oct 25, 2026 18:0515,327138,307,82881,754,00045,461,0002,121,728stderr
3Oct 25, 2026 18:0515,369138,518,69182,503,00045,063,0002,121,728stderr
4Oct 25, 2026 18:0515,390138,795,69282,277,00045,465,0002,121,728stderr
5Oct 25, 2026 18:0515,434139,139,88782,690,00045,415,0002,121,728stderr
6Oct 25, 2026 18:0515,488140,177,28783,825,00044,732,0002,121,728stderr
7Oct 25, 2026 18:0515,493139,652,09382,490,00046,109,0002,121,728stderr
8Oct 25, 2026 18:0515,613140,611,78382,820,00046,768,0002,121,728stderr
9Oct 25, 2026 18:0515,738141,623,03584,150,00046,477,0002,121,728stderr