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 2, 2026 01:36Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 01:360516,483,399506,974,0001,075,0002,117,632expected "53687274297627954 ", got "0 "stderr
2Sep 2, 2026 01:360514,570,376503,854,0001,098,0002,117,632expected "53687475626151519 ", got "0 "stderr
3Sep 2, 2026 01:360517,634,678508,187,0001,013,0002,117,632expected "53683905393478553 ", got "0 "stderr