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:45Josu San MartinJosu San MartinScore: 4,964Success
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:464,73255,371,14038,093,0001,189,0002,375,680
2May 9, 2026 22:464,78356,323,92838,502,0001,203,0002,375,680
3May 9, 2026 22:464,84955,883,67139,031,0001,223,0002,375,680
4May 9, 2026 22:464,89657,162,27839,439,0001,199,0002,363,392
5May 9, 2026 22:464,96457,663,02240,153,0001,052,0002,383,872
6May 9, 2026 22:465,01057,610,13840,385,0001,205,0002,383,872
7May 9, 2026 22:465,02359,867,43440,481,0001,210,0002,371,584
8May 9, 2026 22:465,02556,283,30040,499,0001,210,0002,371,584
9May 9, 2026 22:465,20260,003,19641,969,0001,212,0002,375,680