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:40CheckHarryCheckHarryScore: 3,912Success
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:413,90342,248,07831,390,0001,010,0002,113,536
2Sep 6, 2026 03:413,90443,389,29131,395,0001,010,0002,113,536
3Sep 6, 2026 03:413,90642,359,89031,408,0001,013,0002,113,536
4Sep 6, 2026 03:413,91042,321,16131,448,0001,008,0002,113,536
5Sep 6, 2026 03:413,91242,359,95631,456,0001,015,0002,113,536
6Sep 6, 2026 03:413,91342,316,96931,463,0001,019,0002,113,536
7Sep 6, 2026 03:413,94242,681,21231,710,0001,010,0002,113,536
8Sep 6, 2026 03:414,05543,515,36832,644,0001,013,0002,113,536
9Sep 6, 2026 03:414,09043,907,14632,940,0001,011,0002,113,536