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 6, 2026 02:27CheckHarryCheckHarryScore: 4,544Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 02:294,50647,353,93336,180,0001,220,0002,113,536
2Sep 6, 2026 02:294,51847,404,43536,264,0001,237,0002,113,536
3Sep 6, 2026 02:294,52747,443,49136,344,0001,233,0002,113,536
4Sep 6, 2026 02:294,53547,467,97736,409,0001,237,0002,113,536
5Sep 6, 2026 02:294,54447,634,63336,482,0001,240,0002,113,536
6Sep 6, 2026 02:294,54647,592,61236,504,0001,236,0002,113,536
7Sep 6, 2026 02:294,55947,729,16236,625,0001,221,0002,113,536
8Sep 6, 2026 02:294,56347,771,36336,643,0001,235,0002,113,536
9Sep 6, 2026 02:294,59547,968,72336,902,0001,237,0002,113,536