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 listJun 11, 2026 02:00Victor MerckléVictor MerckléScore: 6,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 02:016,45961,012,21351,422,0002,193,0002,113,536
2Jun 11, 2026 02:016,46261,050,64751,613,0002,024,0002,113,536
3Jun 11, 2026 02:016,46961,068,42852,668,0001,026,0002,113,536
4Jun 11, 2026 02:016,47461,148,17052,698,0001,037,0002,113,536
5Jun 11, 2026 02:016,50561,498,87251,868,0002,128,0002,113,536
6Jun 11, 2026 02:016,52861,810,44153,159,0001,026,0002,113,536
7Jun 11, 2026 02:016,54961,748,48052,349,0002,012,0002,113,536
8Jun 11, 2026 02:016,55661,851,88553,391,0001,024,0002,113,536
9Jun 11, 2026 02:016,66962,896,81854,322,0001,031,0002,113,536