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:31CheckHarryCheckHarryScore: 3,952Success
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:333,93442,606,07431,644,0001,014,0002,113,536
2Sep 6, 2026 03:333,93642,573,03631,662,0001,009,0002,113,536
3Sep 6, 2026 03:333,94442,628,14531,729,0001,011,0002,113,536
4Sep 6, 2026 03:333,94642,627,70931,743,0001,013,0002,113,536
5Sep 6, 2026 03:333,95242,741,63131,788,0001,015,0002,113,536
6Sep 6, 2026 03:334,04743,409,07532,398,0001,200,0002,113,536
7Sep 6, 2026 03:334,07343,712,69932,799,0001,012,0002,113,536
8Sep 6, 2026 03:334,07543,722,84432,795,0001,029,0002,113,536
9Sep 6, 2026 03:334,10043,939,93533,025,0001,013,0002,113,536