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:08Daniel MastalerzDaniel MastalerzScore: 6,139Success
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:086,03880,656,39246,106,0004,009,0002,330,624
2Feb 19, 2026 20:086,05173,106,56846,209,0004,018,0002,519,040
3Feb 19, 2026 20:086,05877,696,84946,256,0004,022,0002,306,048
4Feb 19, 2026 20:086,13976,131,57846,961,0003,996,0002,269,184
5Feb 19, 2026 20:086,14680,107,21247,012,0004,001,0002,523,136
6Feb 19, 2026 20:086,16173,763,92448,132,0003,008,0002,510,848