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 10, 2026 07:47Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 07:48054,986,72533,320,0001,072,0002,486,272expected "53688886599867204 ", got "53688886516881750 "
2May 10, 2026 07:484,10449,119,91732,975,0001,093,0002,486,272
3May 10, 2026 07:484,10448,528,13732,952,0001,112,0002,486,272
4May 10, 2026 07:484,10552,162,88532,958,0001,117,0002,482,176
5May 10, 2026 07:484,10948,125,48232,983,0001,128,0002,498,560
6May 10, 2026 07:484,11149,104,74633,028,0001,099,0002,486,272
7May 10, 2026 07:484,12349,621,42133,204,0001,023,0002,322,432
8May 10, 2026 07:484,12951,793,51833,103,0001,175,0002,482,176
9May 10, 2026 07:484,13948,552,63933,314,0001,043,0002,482,176