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:35Andrew TsibinAndrew TsibinScore: 5,178Success
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:355,11552,028,91641,440,0001,018,0002,113,536
2Jul 14, 2026 23:355,13652,195,28841,608,0001,024,0002,113,536
3Jul 14, 2026 23:355,14452,335,62541,680,0001,018,0002,113,536
4Jul 14, 2026 23:355,15252,406,42341,619,0001,148,0002,113,536
5Jul 14, 2026 23:355,17852,570,98541,978,0001,006,0002,113,536
6Jul 14, 2026 23:355,21852,862,19942,307,0001,010,0002,113,536
7Jul 14, 2026 23:355,22052,891,18742,319,0001,012,0002,113,536
8Jul 14, 2026 23:355,22352,900,62842,348,0001,007,0002,113,536
9Jul 14, 2026 23:355,23253,413,15742,379,0001,049,0002,113,536