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 14, 2026 00:03drewbumpasdrewbumpasScore: 365,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 00:04364,6803,037,246,8442,957,678,00069,167,0002,113,536
2Sep 14, 2026 00:04364,7203,037,715,3132,958,119,00069,065,0002,113,536
3Sep 14, 2026 00:04364,7253,037,717,6982,958,157,00069,067,0002,113,536
4Sep 14, 2026 00:04364,9273,039,348,8942,958,851,00070,050,0002,113,536
5Sep 14, 2026 00:04365,0163,040,049,0882,959,580,00070,057,0002,113,536
6Sep 14, 2026 00:04366,3933,051,427,1442,972,019,00069,044,0002,113,536
7Sep 14, 2026 00:04368,9893,073,175,5392,993,555,00069,057,0002,113,536
8Sep 14, 2026 00:04371,0613,090,203,7053,011,763,00068,050,0002,113,536
9Sep 14, 2026 00:04371,7583,095,976,5543,016,474,00069,118,0002,113,536