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 15, 2026 18:51Daniel MastalerzDaniel MastalerzScore: 6,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 18:516,28378,043,70848,136,0004,011,0002,273,280
2Feb 15, 2026 18:516,29675,918,86048,235,0004,019,0002,265,088
3Feb 15, 2026 18:516,29977,092,37148,260,0004,021,0002,322,432
4Feb 15, 2026 18:516,38480,064,76949,988,0002,999,0002,318,336
5Feb 15, 2026 18:516,39278,164,77650,054,0003,003,0002,306,048
6Feb 15, 2026 18:516,40477,248,41350,142,0003,008,0002,318,336