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 2, 2026 12:31CheckHarryCheckHarryScore: 9,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 12:319,62090,643,29578,611,0001,242,0002,113,536
2Sep 2, 2026 12:319,62490,682,58178,612,0001,274,0002,113,536
3Sep 2, 2026 12:319,62790,763,06978,655,0001,257,0002,113,536
4Sep 2, 2026 12:319,67392,677,99479,048,0001,240,0002,113,536
5Sep 2, 2026 12:319,67591,169,97379,296,0001,007,0002,113,536
6Sep 2, 2026 12:319,68890,619,78179,407,0001,009,0002,113,536
7Sep 2, 2026 12:319,71391,525,66979,366,0001,255,0002,113,536
8Sep 2, 2026 12:319,73290,865,91379,508,0001,270,0002,113,536
9Sep 2, 2026 12:319,73790,942,20579,808,0001,016,0002,113,536