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 21:38Josu San MartinJosu San MartinScore: 4,242Success
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 21:384,20743,412,65633,890,0001,033,0002,113,536
2Aug 30, 2026 21:384,21043,365,46833,909,0001,034,0002,113,536
3Aug 30, 2026 21:384,22843,570,50733,969,0001,124,0002,113,536
4Aug 30, 2026 21:384,23743,610,18834,128,0001,045,0002,113,536
5Aug 30, 2026 21:384,24243,653,77634,171,0001,045,0002,113,536
6Aug 30, 2026 21:384,24443,690,24434,189,0001,044,0002,113,536
7Aug 30, 2026 21:384,25643,761,03034,212,0001,116,0002,113,536
8Aug 30, 2026 21:384,26443,897,48934,382,0001,017,0002,113,536
9Aug 30, 2026 21:384,29944,254,91134,567,0001,116,0002,113,536