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 21, 2026 14:08Daniel MastalerzDaniel MastalerzScore: 5,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 14:085,57367,141,53442,232,0004,022,0002,265,088
2Feb 21, 2026 14:085,58172,023,34243,304,0003,021,0002,273,280
3Feb 21, 2026 14:085,58467,597,03743,324,0003,022,0002,326,528
4Feb 21, 2026 14:085,58968,501,60143,367,0003,025,0002,326,528
5Feb 21, 2026 14:085,59470,312,62742,397,0004,037,0002,326,528
6Feb 21, 2026 14:085,60067,363,77343,452,0003,031,0002,326,528
7Feb 21, 2026 14:085,61980,273,17644,609,0002,027,0002,310,144
8Feb 21, 2026 14:085,62278,138,61143,617,0003,043,0002,326,528
9Feb 21, 2026 14:085,63876,783,70344,804,0001,991,0002,306,048
10Feb 21, 2026 14:085,67866,293,63944,120,0003,008,0002,281,472
11Feb 21, 2026 14:085,68672,091,10243,175,0004,016,0002,310,144
12Feb 21, 2026 14:085,68771,954,55244,192,0003,013,0002,519,040