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 27, 2026 15:30boop34boop34Score: 9,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2026 15:319,11685,471,64174,544,0001,120,0002,117,632
2Oct 27, 2026 15:319,13685,736,61174,732,0001,101,0002,117,632
3Oct 27, 2026 15:319,13785,738,38274,722,0001,119,0002,117,632
4Oct 27, 2026 15:319,14185,255,44774,735,0001,139,0002,117,632
5Oct 27, 2026 15:319,14387,231,42774,773,0001,116,0002,117,632
6Oct 27, 2026 15:319,15485,926,15074,865,0001,118,0002,117,632
7Oct 27, 2026 15:319,15986,018,15774,859,0001,163,0002,117,632
8Oct 27, 2026 15:319,17585,750,47175,044,0001,113,0002,117,632
9Oct 27, 2026 15:319,34986,938,09176,492,0001,110,0002,117,632