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 13, 2026 21:48Victor MerckléVictor MerckléScore: 53,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 21:4852,610445,730,561435,660,0001,004,0002,117,632stderr
2May 13, 2026 21:4852,700445,302,989436,411,0001,004,0002,117,632stderr
3May 13, 2026 21:4853,018449,936,718439,046,0001,004,0002,117,632stderr
4May 13, 2026 21:4853,132448,295,705439,996,0001,004,0002,117,632stderr
5May 13, 2026 21:4853,184449,329,739440,430,0001,004,0002,117,632stderr
6May 13, 2026 21:4853,190451,037,158440,479,0001,004,0002,117,632stderr
7May 13, 2026 21:4853,197449,032,796440,540,0001,003,0002,117,632stderr
8May 13, 2026 21:4853,207450,751,497440,617,0001,004,0002,117,632stderr
9May 13, 2026 21:4853,243449,007,796440,915,0001,004,0002,117,632stderr