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 20:20Daniel MastalerzDaniel MastalerzScore: 6,407Success
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 20:206,31773,557,58649,407,0003,024,0002,273,280
2Feb 19, 2026 20:206,31978,508,72249,421,0003,025,0002,265,088
3Feb 19, 2026 20:206,32075,205,36448,418,0004,034,0002,273,280
4Feb 19, 2026 20:206,40776,163,19649,163,0004,013,0002,310,144
5Feb 19, 2026 20:206,42077,687,04450,267,0003,016,0002,281,472
6Feb 19, 2026 20:206,43076,023,56449,345,0004,028,0002,306,048