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 listMay 19, 2026 06:20poilonpoilonError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 06:2101,193,027,4211,172,002,0007,938,0002,215,936expected "53684866316904764 ", got "DIAG_BUILD_PLEASE_SHOW_STDERR "stderr
2May 19, 2026 06:2101,182,485,9871,162,253,0007,014,0002,224,128expected "53692636387869490 ", got "DIAG_BUILD_PLEASE_SHOW_STDERR "stderr
3May 19, 2026 06:2101,195,136,1731,173,659,0006,971,0002,220,032expected "53689531658606972 ", got "DIAG_BUILD_PLEASE_SHOW_STDERR "stderr