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 2, 2026 20:55TonyTonyScore: 8,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 20:558,36579,290,56566,772,0002,659,0002,113,536
2Aug 2, 2026 20:558,38479,381,58867,515,0002,075,0002,113,536
3Aug 2, 2026 20:558,39179,544,27167,537,0002,115,0002,113,536
4Aug 2, 2026 20:558,41579,739,53367,207,0002,640,0002,113,536
5Aug 2, 2026 20:558,42079,723,50267,255,0002,636,0002,113,536
6Aug 2, 2026 20:558,42879,780,45267,319,0002,639,0002,113,536
7Aug 2, 2026 20:558,43479,875,87967,904,0002,099,0002,113,536
8Aug 2, 2026 20:558,44379,872,67567,404,0002,677,0002,113,536
9Aug 2, 2026 20:558,46380,054,58667,559,0002,685,0002,113,536