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 listFeb 19, 2026 23:09Daniel MastalerzDaniel MastalerzScore: 8,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 23:128,822100,893,21671,214,0002,006,0002,289,664
2Feb 19, 2026 23:128,82396,573,72172,231,0001,003,0002,293,760
3Feb 19, 2026 23:098,830105,791,10371,284,0002,008,0002,293,760
4Feb 19, 2026 23:128,83092,957,40671,284,0002,008,0002,269,184
5Feb 19, 2026 23:098,843101,053,21271,390,0002,010,0002,293,760
6Feb 19, 2026 23:098,84997,184,47070,427,0003,018,0002,523,136
7Feb 19, 2026 23:099,025102,023,71873,911,000998,0002,281,472
8Feb 19, 2026 23:099,02698,019,47072,916,0001,997,0002,289,664
9Feb 19, 2026 23:099,033102,427,93872,979,0001,999,0002,289,664