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 17, 2026 19:25Kevin HeaveyKevin HeaveyScore: 3,810Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 19:463,60839,762,65428,727,0001,226,0002,117,632
2Jul 17, 2026 19:463,64139,962,09228,988,0001,237,0002,117,632
3Jul 17, 2026 19:463,75740,927,78929,948,0001,238,0002,117,632
4Jul 17, 2026 19:463,79041,217,96630,417,0001,045,0002,117,632
5Jul 17, 2026 19:463,81041,414,62330,592,0001,039,0002,117,632
6Jul 17, 2026 19:463,87441,895,68831,117,0001,038,0002,117,632
7Jul 17, 2026 19:463,89449,903,49831,285,0001,041,0002,117,632
8Jul 17, 2026 19:463,89542,054,42431,111,0001,218,0002,117,632
9Jul 17, 2026 19:463,95142,565,89931,756,0001,042,0002,117,632