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 23, 2026 07:45Kevin HeaveyKevin HeaveyScore: 3,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 07:473,33636,496,86326,568,0001,128,0002,113,536
2Sep 23, 2026 07:473,34636,601,67626,745,0001,030,0002,113,536
3Sep 23, 2026 07:473,35437,337,68626,830,0001,010,0002,113,536
4Sep 23, 2026 07:473,35436,531,30426,730,0001,113,0002,113,536
5Sep 23, 2026 07:473,35536,464,03426,810,0001,042,0002,113,536
6Sep 23, 2026 07:473,35937,464,01126,872,0001,015,0002,113,536
7Sep 23, 2026 07:473,36138,013,77226,879,0001,018,0002,113,536
8Sep 23, 2026 07:473,36337,476,66426,897,0001,019,0002,113,536
9Sep 23, 2026 07:473,37737,586,07526,831,0001,200,0002,113,536