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 9, 2026 22:41Josu San MartinJosu San MartinScore: 4,796Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 22:424,75456,230,53438,260,0001,204,0002,371,584
2May 9, 2026 22:424,76054,428,82138,302,0001,206,0002,387,968
3May 9, 2026 22:424,76055,597,44538,299,0001,210,0002,379,776
4May 9, 2026 22:424,78755,280,36638,688,0001,051,0002,375,680
5May 9, 2026 22:424,79656,353,97838,608,0001,202,0002,379,776
6May 9, 2026 22:424,79955,010,00338,609,0001,226,0002,367,488
7May 9, 2026 22:424,84557,166,99639,183,0001,035,0002,379,776
8May 9, 2026 22:424,88459,878,13539,498,0001,041,0002,367,488
9May 9, 2026 22:424,88956,394,26539,392,0001,191,0002,375,680