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 27, 2026 07:00Karthik ReddyKarthik ReddyScore: 4,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2026 07:024,92551,166,94839,738,0001,147,0002,113,536
2Sep 27, 2026 07:024,93451,220,29039,823,0001,137,0002,113,536
3Sep 27, 2026 07:024,93751,318,03339,826,0001,152,0002,113,536
4Sep 27, 2026 07:024,94451,308,46939,907,0001,135,0002,113,536
5Sep 27, 2026 07:024,94551,357,20439,917,0001,133,0002,113,536
6Sep 27, 2026 07:024,94751,392,50139,931,0001,136,0002,113,536
7Sep 27, 2026 07:024,95451,335,36639,974,0001,148,0002,113,536
8Sep 27, 2026 07:024,98451,634,37940,229,0001,143,0002,113,536
9Sep 27, 2026 07:025,05952,287,55540,856,0001,141,0002,113,536