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 00:51Josu San MartinJosu San MartinScore: 5,970Success
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 00:525,90158,346,44045,552,0003,434,0002,113,536
2Jul 4, 2026 00:525,92358,525,33845,853,0003,313,0002,113,536
3Jul 4, 2026 00:525,95658,837,69846,064,0003,374,0002,113,536
4Jul 4, 2026 00:525,96858,893,93846,156,0003,380,0002,113,536
5Jul 4, 2026 00:525,97058,843,09346,455,0003,101,0002,113,536
6Jul 4, 2026 00:525,98959,106,30246,160,0003,550,0002,113,536
7Jul 4, 2026 00:526,01959,287,58046,504,0003,454,0002,113,536
8Jul 4, 2026 00:526,03359,355,29146,581,0003,497,0002,113,536
9Jul 4, 2026 00:526,10060,125,99547,089,0003,542,0002,113,536