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 29, 2026 01:54Victor MerckléVictor MerckléScore: 4,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 01:554,26343,319,01134,257,0001,129,0002,125,824
2Jun 29, 2026 01:554,27343,377,21634,365,0001,105,0002,134,016
3Jun 29, 2026 01:554,27643,446,76034,391,0001,108,0002,134,016
4Jun 29, 2026 01:554,27943,451,61134,383,0001,140,0002,125,824
5Jun 29, 2026 01:554,28143,444,66034,437,0001,102,0002,134,016
6Jun 29, 2026 01:554,30043,567,27434,575,0001,121,0002,125,824
7Jun 29, 2026 01:554,31743,752,12334,808,0001,028,0002,134,016
8Jun 29, 2026 01:554,32543,823,12134,848,0001,052,0002,134,016
9Jun 29, 2026 01:554,33843,906,47134,879,0001,128,0002,134,016