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:51CheckHarryCheckHarryScore: 4,140Success
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:524,13544,245,16933,315,0001,010,0002,113,536
2Sep 6, 2026 02:524,13644,278,25633,319,0001,017,0002,113,536
3Sep 6, 2026 02:524,13944,153,34133,336,0001,019,0002,113,536
4Sep 6, 2026 02:524,13944,275,96733,332,0001,023,0002,113,536
5Sep 6, 2026 02:524,14044,323,66533,349,0001,021,0002,113,536
6Sep 6, 2026 02:524,14044,303,19733,352,0001,018,0002,113,536
7Sep 6, 2026 02:524,14244,278,70533,372,0001,013,0002,113,536
8Sep 6, 2026 02:524,16244,449,49233,531,0001,015,0002,113,536
9Sep 6, 2026 02:524,20944,940,21333,921,0001,015,0002,113,536