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 3, 2026 01:19CheckHarryCheckHarryScore: 7,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 01:197,34970,885,77759,953,0001,049,0002,113,536
2Sep 3, 2026 01:197,35370,886,64959,994,0001,041,0002,113,536
3Sep 3, 2026 01:197,35470,896,98459,993,0001,050,0002,113,536
4Sep 3, 2026 01:197,35570,910,29260,004,0001,044,0002,113,536
5Sep 3, 2026 01:197,35571,022,29959,999,0001,055,0002,113,536
6Sep 3, 2026 01:197,35571,026,47960,004,0001,043,0002,113,536
7Sep 3, 2026 01:197,35571,209,45460,001,0001,052,0002,113,536
8Sep 3, 2026 01:197,35671,641,21860,000,0001,062,0002,113,536
9Sep 3, 2026 01:197,36171,007,31860,055,0001,048,0002,113,536