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 listAug 30, 2026 22:09Josu San MartinJosu San MartinScore: 4,410Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 22:104,36044,637,87535,159,0001,036,0002,113,536
2Aug 30, 2026 22:104,38344,896,45135,329,0001,055,0002,113,536
3Aug 30, 2026 22:104,39044,886,95835,331,0001,113,0002,113,536
4Aug 30, 2026 22:104,40144,999,16135,408,0001,127,0002,113,536
5Aug 30, 2026 22:104,41045,122,74935,493,0001,116,0002,113,536
6Aug 30, 2026 22:104,42045,115,25135,585,0001,107,0002,113,536
7Aug 30, 2026 22:104,43453,821,76735,660,0001,146,0002,113,536
8Aug 30, 2026 22:104,44645,391,29835,780,0001,125,0002,113,536
9Aug 30, 2026 22:104,70553,730,39238,038,0001,021,0002,113,536