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:36CheckHarryCheckHarryScore: 4,221Success
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:374,20044,772,11333,854,0001,010,0002,113,536
2Sep 6, 2026 02:374,20544,816,51733,873,0001,035,0002,113,536
3Sep 6, 2026 02:374,20844,742,56333,923,0001,008,0002,113,536
4Sep 6, 2026 02:374,22044,782,82334,005,0001,024,0002,113,536
5Sep 6, 2026 02:374,22144,986,57734,033,0001,009,0002,113,536
6Sep 6, 2026 02:374,22244,914,91034,039,0001,008,0002,113,536
7Sep 6, 2026 02:374,23044,988,47334,095,0001,020,0002,113,536
8Sep 6, 2026 02:374,34846,443,80635,079,0001,014,0002,113,536
9Sep 6, 2026 02:374,40446,476,00635,538,0001,022,0002,113,536