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 listApr 25, 2026 01:35Charles CabergsCharles CabergsScore: 19,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 01:3519,306178,802,044160,247,00002,367,488
2Apr 25, 2026 01:3519,337179,256,276159,498,0001,003,0002,367,488
3Apr 25, 2026 01:3519,354179,269,440158,645,0001,995,0002,355,200
4Apr 25, 2026 01:3519,354180,259,604158,644,0001,995,0002,306,048
5Apr 25, 2026 01:3519,363179,590,600158,718,0001,996,0002,367,488
6Apr 25, 2026 01:3519,383179,192,621158,882,0001,998,0002,371,584
7Apr 25, 2026 01:3520,064187,736,403165,535,0001,003,0002,359,296
8Apr 25, 2026 01:3520,071186,950,646165,591,0001,003,0002,375,680
9Apr 25, 2026 01:3520,090185,339,897164,755,0001,997,0002,363,392