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,313Success
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:304,25845,281,99034,336,0001,007,0002,113,536
2Sep 6, 2026 02:304,26745,293,66634,414,0001,008,0002,113,536
3Sep 6, 2026 02:304,27845,384,67634,495,0001,019,0002,113,536
4Sep 6, 2026 02:304,28445,372,55034,386,0001,174,0002,113,536
5Sep 6, 2026 02:304,31345,799,83434,774,0001,024,0002,113,536
6Sep 6, 2026 02:304,32845,838,76334,913,0001,011,0002,113,536
7Sep 6, 2026 02:304,35546,096,53435,141,0001,012,0002,113,536
8Sep 6, 2026 02:304,39246,397,49735,443,0001,015,0002,113,536
9Sep 6, 2026 02:304,39346,374,41235,329,0001,134,0002,113,536