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 listMay 10, 2026 00:31Josu San MartinJosu San MartinScore: 4,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 00:314,67653,522,71837,769,0001,049,0002,473,984
2May 10, 2026 00:314,69853,608,89937,937,0001,062,0002,473,984
3May 10, 2026 00:314,74455,003,71038,193,0001,190,0002,473,984
4May 10, 2026 00:314,76152,536,04338,435,0001,085,0002,469,888
5May 10, 2026 00:314,79554,665,32538,601,0001,205,0002,465,792
6May 10, 2026 00:314,94655,439,42339,991,0001,065,0002,469,888
7May 10, 2026 00:314,98558,876,37140,302,0001,080,0002,469,888
8May 10, 2026 00:315,00958,352,66140,484,0001,093,0002,469,888
9May 10, 2026 00:315,24258,897,62242,381,0001,128,0002,469,888