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 16:43Victor MerckléVictor MerckléScore: 4,820Success
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 16:474,52946,085,15431,742,0005,856,00024,576stderr
2Sep 7, 2026 16:474,59546,613,94832,374,0005,767,00024,576stderr
3Sep 7, 2026 16:474,67847,368,56833,159,0005,671,00024,576stderr
4Sep 7, 2026 16:474,79748,334,93232,973,0006,848,00024,576stderr
5Sep 7, 2026 16:474,82048,517,40631,907,0008,106,00024,576stderr
6Sep 7, 2026 16:474,86448,947,87332,140,0008,237,00024,576stderr
7Sep 7, 2026 16:474,92551,347,14434,967,0005,915,00024,576stderr
8Sep 7, 2026 16:474,94949,656,48832,972,0008,109,00024,576stderr
9Sep 7, 2026 16:474,95049,589,64334,982,0006,104,00024,576stderr