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:37Karthik ReddyKarthik ReddyScore: 4,737Success
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:384,70549,312,09437,915,0001,144,0002,113,536
2Sep 27, 2026 07:384,72649,565,23938,093,0001,141,0002,113,536
3Sep 27, 2026 07:384,72749,537,92138,107,0001,131,0002,113,536
4Sep 27, 2026 07:384,73250,243,64238,129,0001,153,0002,113,536
5Sep 27, 2026 07:384,73749,667,09038,161,0001,163,0002,113,536
6Sep 27, 2026 07:384,73849,641,82638,174,0001,152,0002,113,536
7Sep 27, 2026 07:384,75456,595,33438,321,0001,141,0002,113,536
8Sep 27, 2026 07:384,75749,796,01338,407,0001,081,0002,113,536
9Sep 27, 2026 07:384,81751,618,42138,848,0001,136,0002,113,536