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 listAug 30, 2026 18:42Josu San MartinJosu San MartinScore: 5,179Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 18:425,03850,267,79340,725,0001,094,0002,113,536
2Aug 30, 2026 18:425,10550,950,34141,269,0001,103,0002,113,536
3Aug 30, 2026 18:425,13751,106,29141,600,0001,042,0002,113,536
4Aug 30, 2026 18:425,15051,245,66041,708,0001,041,0002,113,536
5Aug 30, 2026 18:425,17952,189,48541,937,0001,051,0002,113,536
6Aug 30, 2026 18:425,18251,480,79041,955,0001,058,0002,113,536
7Aug 30, 2026 18:425,21451,762,59442,236,0001,046,0002,113,536
8Aug 30, 2026 18:425,22753,033,57242,348,0001,044,0002,113,536
9Aug 30, 2026 18:425,22851,945,10042,368,0001,032,0002,113,536