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 listSep 12, 2026 15:09Kevin HeaveyKevin HeaveyScore: 3,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 15:103,66240,669,77629,356,0001,042,0002,117,632
2Sep 12, 2026 15:103,78441,683,88930,167,0001,244,0002,117,632
3Sep 12, 2026 15:103,85242,192,30730,770,0001,205,0002,117,632
4Sep 12, 2026 15:103,89542,565,48231,114,0001,216,0002,117,632
5Sep 12, 2026 15:103,90742,701,76031,392,0001,040,0002,117,632
6Sep 12, 2026 15:103,91342,634,78731,437,0001,049,0002,117,632
7Sep 12, 2026 15:103,93142,863,36231,391,0001,241,0002,117,632
8Sep 12, 2026 15:103,95143,077,84031,778,0001,022,0002,117,632
9Sep 12, 2026 15:103,96243,122,81731,653,0001,232,0002,117,632