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 14, 2026 08:01Victor MerckléVictor MerckléScore: 60,729Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 08:0160,604510,326,565501,927,0001,089,0002,117,632stderr
2May 14, 2026 08:0160,636510,545,767502,141,0001,142,0002,117,632stderr
3May 14, 2026 08:0160,662512,890,083502,374,0001,122,0002,117,632stderr
4May 14, 2026 08:0160,691511,727,256502,625,0001,115,0002,117,632stderr
5May 14, 2026 08:0160,729513,859,288503,039,0001,013,0002,117,632stderr
6May 14, 2026 08:0160,730511,489,946503,059,0001,003,0002,117,632stderr
7May 14, 2026 08:0160,746513,321,810503,028,0001,168,0002,117,632stderr
8May 14, 2026 08:0160,752512,629,422503,192,0001,056,0002,117,632stderr
9May 14, 2026 08:0160,823512,150,268503,712,0001,123,0002,117,632stderr