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 8, 2026 00:09Victor MerckléVictor MerckléScore: 4,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 00:114,32745,237,33732,007,0003,914,00024,576stderr
2Sep 8, 2026 00:114,35444,925,62332,151,0003,993,00024,576stderr
3Sep 8, 2026 00:114,35944,454,99731,621,0004,561,00024,576stderr
4Sep 8, 2026 00:114,37145,401,02531,303,0004,980,0002,117,632stderr
5Sep 8, 2026 00:114,39245,664,31632,317,0004,137,00024,576stderr
6Sep 8, 2026 00:114,47745,686,58532,961,0004,204,00024,576stderr
7Sep 8, 2026 00:114,50646,668,57033,410,0003,996,00024,576stderr
8Sep 8, 2026 00:114,51746,686,68633,137,0004,358,00024,576stderr
9Sep 8, 2026 00:114,53746,001,12633,131,0004,534,00024,576stderr