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 26, 2026 02:00sophiasophiaScore: 66,261Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 02:0066,252581,354,456547,895,0001,999,0002,523,136
2Feb 26, 2026 02:0066,253580,791,454545,902,0003,999,0002,514,944
3Feb 26, 2026 02:0066,257575,764,960548,930,000999,0002,387,968
4Feb 26, 2026 02:0066,258575,776,718546,946,0002,999,0002,514,944
5Feb 26, 2026 02:0066,261573,007,315549,970,00002,523,136
6Feb 26, 2026 02:0066,279570,195,798547,112,0003,000,0002,375,680
7Feb 26, 2026 02:0066,287572,787,299549,181,0001,000,0002,375,680
8Feb 26, 2026 02:0066,290574,186,494549,203,0001,000,0002,514,944
9Feb 26, 2026 02:0066,386572,748,577550,005,0001,000,0002,375,680