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 03:50CheckHarryCheckHarryScore: 3,875Success
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 03:503,85341,875,14430,977,0001,009,0002,113,536
2Sep 6, 2026 03:503,85941,940,31531,026,0001,010,0002,113,536
3Sep 6, 2026 03:503,86242,306,47831,019,0001,040,0002,113,536
4Sep 6, 2026 03:503,86341,979,24731,059,0001,010,0002,113,536
5Sep 6, 2026 03:503,87542,041,14630,976,0001,188,0002,113,536
6Sep 6, 2026 03:503,88651,925,55831,208,0001,047,0002,113,536
7Sep 6, 2026 03:503,92642,558,39131,572,0001,016,0002,113,536
8Sep 6, 2026 03:503,94842,579,59831,764,0001,012,0002,113,536
9Sep 6, 2026 03:503,99443,038,63132,146,0001,011,0002,113,536