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 21, 2026 01:50Andrew EpsteinAndrew EpsteinScore: 4,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2026 01:504,20444,652,83332,571,0002,327,0002,113,536
2Aug 21, 2026 01:504,22046,083,85832,683,0002,351,0002,113,536
3Aug 21, 2026 01:504,25645,077,02833,009,0002,323,0002,113,536
4Aug 21, 2026 01:504,31345,576,89533,482,0002,318,0002,113,536
5Aug 21, 2026 01:504,36746,059,24033,923,0002,329,0002,113,536
6Aug 21, 2026 01:504,36846,136,37733,933,0002,324,0002,113,536
7Aug 21, 2026 01:504,37346,143,77233,987,0002,314,0002,113,536
8Aug 21, 2026 01:504,39146,299,31134,085,0002,361,0002,113,536
9Aug 21, 2026 01:504,41846,462,88534,343,0002,332,0002,113,536