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 14:37satoru.netsatoru.netScore: 47,789Success
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 14:3747,761425,017,128396,415,00002,387,968
2Feb 23, 2026 14:3747,776427,112,990396,537,00002,273,280
3Feb 23, 2026 14:3747,777422,433,358396,552,00002,273,280
4Feb 23, 2026 14:3747,787421,322,921395,635,000999,0002,392,064
5Feb 23, 2026 14:3747,789429,884,353396,647,00002,273,280
6Feb 23, 2026 14:3747,798422,646,531395,721,000999,0002,273,280
7Feb 23, 2026 14:3747,813422,669,869395,848,000999,0002,392,064
8Feb 23, 2026 14:3747,845426,870,087396,110,0001,000,0002,273,280
9Feb 23, 2026 14:3747,907430,137,181395,632,0001,998,0002,273,280