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 23, 2026 21:47Daniel MastalerzDaniel MastalerzScore: 6,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 21:476,01376,049,76844,915,0004,990,0002,519,040
2Feb 23, 2026 21:476,02677,960,04545,017,0005,001,0002,498,560
3Feb 23, 2026 21:466,02775,133,19747,025,0003,001,0002,494,464
4Feb 23, 2026 21:466,03272,643,72948,062,0002,002,0002,342,912
5Feb 23, 2026 21:466,05974,477,71147,271,0003,017,0002,281,472
6Feb 23, 2026 21:476,06572,989,31945,307,0005,034,0002,490,368
7Feb 23, 2026 21:466,12079,273,83746,810,0003,983,0002,277,376
8Feb 23, 2026 21:466,12573,917,05444,855,0005,980,0002,265,088
9Feb 23, 2026 21:476,16074,034,43447,120,0004,010,0002,265,088
10Feb 23, 2026 21:466,17072,895,59848,200,0003,012,0002,523,136
11Feb 23, 2026 21:476,19178,083,42346,346,0005,037,0002,310,144
12Feb 23, 2026 21:476,19276,041,24248,373,0003,023,0002,277,376