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 22:32Josu San MartinJosu San MartinScore: 4,268Success
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 22:354,25643,729,78534,278,0001,053,0002,113,536
2Aug 30, 2026 22:354,25743,741,63334,315,0001,026,0002,113,536
3Aug 30, 2026 22:354,25943,856,81534,317,0001,040,0002,113,536
4Aug 30, 2026 22:354,26543,809,09634,348,0001,057,0002,113,536
5Aug 30, 2026 22:354,26843,817,09234,382,0001,046,0002,113,536
6Aug 30, 2026 22:354,27543,902,45134,454,0001,035,0002,113,536
7Aug 30, 2026 22:354,29244,021,98234,603,0001,027,0002,113,536
8Aug 30, 2026 22:354,30844,168,96234,718,0001,040,0002,113,536
9Aug 30, 2026 22:354,41445,091,16135,603,0001,041,0002,113,536