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 5, 2026 17:56CheckHarryCheckHarryScore: 4,634Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 17:584,57547,826,83736,956,0001,017,0002,113,536
2Sep 5, 2026 17:584,57647,933,02036,974,0001,015,0002,113,536
3Sep 5, 2026 17:584,60248,096,87937,181,0001,016,0002,113,536
4Sep 5, 2026 17:584,60648,189,35537,215,0001,016,0002,113,536
5Sep 5, 2026 17:584,63448,335,00337,432,0001,033,0002,113,536
6Sep 5, 2026 17:584,65548,464,66637,628,0001,016,0002,113,536
7Sep 5, 2026 17:584,68548,789,08137,862,0001,025,0002,113,536
8Sep 5, 2026 17:584,76650,064,03838,547,0001,018,0002,113,536
9Sep 5, 2026 17:584,79449,686,57238,781,0001,014,0002,113,536