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 08:04CheckHarryCheckHarryScore: 4,188Success
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 08:044,17244,486,27533,623,0001,011,0002,113,536
2Sep 6, 2026 08:044,17544,480,34433,644,0001,010,0002,113,536
3Sep 6, 2026 08:044,18644,607,25533,743,0001,008,0002,113,536
4Sep 6, 2026 08:044,18644,738,35333,731,0001,018,0002,113,536
5Sep 6, 2026 08:044,18844,623,65433,759,0001,008,0002,113,536
6Sep 6, 2026 08:044,19644,739,84233,713,0001,120,0002,113,536
7Sep 6, 2026 08:044,21655,867,90233,939,0001,060,0002,113,536
8Sep 6, 2026 08:044,29145,499,05934,606,0001,012,0002,113,536
9Sep 6, 2026 08:044,35145,970,75435,110,0001,010,0002,113,536