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:11Victor MerckléVictor MerckléScore: 58,734Success
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:1158,720495,291,937486,376,0001,003,0002,117,632stderr
2May 14, 2026 08:1158,723496,760,611486,405,0001,003,0002,117,632stderr
3May 14, 2026 08:1158,726496,862,928486,428,0001,002,0002,117,632stderr
4May 14, 2026 08:1158,730496,742,032486,461,0001,003,0002,117,632stderr
5May 14, 2026 08:1158,734495,732,175486,492,0001,004,0002,117,632stderr
6May 14, 2026 08:1158,735496,927,399486,501,0001,002,0002,117,632stderr
7May 14, 2026 08:1158,736496,969,052486,507,0001,003,0002,117,632stderr
8May 14, 2026 08:1158,740497,809,726486,542,0001,003,0002,117,632stderr
9May 14, 2026 08:1158,765503,097,318486,753,0001,003,0002,117,632stderr