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 23:00Josu San MartinJosu San MartinScore: 6,164Success
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 23:136,12559,335,24949,829,0001,010,0002,113,536
2Aug 30, 2026 23:136,12659,289,67349,838,0001,011,0002,113,536
3Aug 30, 2026 23:136,13459,414,48949,846,0001,071,0002,113,536
4Aug 30, 2026 23:136,14767,560,87349,913,0001,111,0002,113,536
5Aug 30, 2026 23:136,16467,607,99450,162,0001,004,0002,113,536
6Aug 30, 2026 23:136,17969,010,04350,282,0001,009,0002,113,536
7Aug 30, 2026 23:136,18688,266,42750,230,0001,115,0002,113,536
8Aug 30, 2026 23:136,18959,840,95750,364,0001,012,0002,113,536
9Aug 30, 2026 23:136,21969,080,82150,604,0001,018,0002,113,536