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 listJul 14, 2026 23:36Andrew TsibinAndrew TsibinScore: 5,174Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 23:365,13052,202,34941,570,0001,010,0002,113,536
2Jul 14, 2026 23:365,16052,643,33441,797,0001,033,0002,113,536
3Jul 14, 2026 23:365,16252,433,66241,829,0001,019,0002,113,536
4Jul 14, 2026 23:365,17052,506,07141,909,0001,009,0002,113,536
5Jul 14, 2026 23:365,17452,645,21841,935,0001,012,0002,113,536
6Jul 14, 2026 23:365,17752,607,76741,943,0001,029,0002,113,536
7Jul 14, 2026 23:365,19452,793,52842,105,0001,008,0002,113,536
8Jul 14, 2026 23:365,19652,677,59442,107,0001,020,0002,113,536
9Jul 14, 2026 23:365,22352,884,72242,345,0001,014,0002,113,536