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 7, 2026 18:16Victor MerckléVictor MerckléScore: 41,059Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 18:1840,845347,528,683334,688,0004,333,00024,576stderr
2Sep 7, 2026 18:1840,954349,094,874333,977,0005,942,00024,576stderr
3Sep 7, 2026 18:1841,017349,591,989334,902,0005,544,00024,576stderr
4Sep 7, 2026 18:1841,043349,218,468336,246,0004,418,00024,576stderr
5Sep 7, 2026 18:1841,059349,944,962336,494,0004,300,00024,576stderr
6Sep 7, 2026 18:1841,119349,934,774335,806,0005,482,00024,576stderr
7Sep 7, 2026 18:1841,212351,249,501336,008,0006,052,0002,117,632stderr
8Sep 7, 2026 18:1841,325351,697,034337,124,0005,881,00024,576stderr
9Sep 7, 2026 18:1841,368352,536,517337,292,0006,066,00024,576stderr