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 listJul 4, 2026 01:04Josu San MartinJosu San MartinScore: 5,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 01:045,12551,869,67739,172,0003,370,0002,113,536
2Jul 4, 2026 01:045,19952,512,73939,769,0003,386,0002,129,920
3Jul 4, 2026 01:045,20952,620,41539,750,0003,490,0002,113,536
4Jul 4, 2026 01:045,21752,763,32839,951,0003,357,0002,113,536
5Jul 4, 2026 01:045,23054,365,33240,306,0003,107,0002,113,536
6Jul 4, 2026 01:045,23252,766,14639,962,0003,466,0002,113,536
7Jul 4, 2026 01:045,24852,999,54840,166,0003,394,0002,113,536
8Jul 4, 2026 01:045,25453,071,36040,213,0003,399,0002,113,536
9Jul 4, 2026 01:045,39754,247,69541,257,0003,543,0002,113,536