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 17:11satoru.netsatoru.netScore: 35,264Success
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 17:1135,253318,777,633290,604,0001,997,0002,400,256
2Feb 23, 2026 17:1135,260324,770,532290,658,0001,997,0002,277,376
3Feb 23, 2026 17:1135,261325,136,188291,666,0001,002,0002,277,376
4Feb 23, 2026 17:1135,264321,033,692291,697,000998,0002,412,544
5Feb 23, 2026 17:1135,264318,064,645290,696,0001,997,0002,277,376
6Feb 23, 2026 17:1135,267323,032,464291,718,000999,0002,383,872
7Feb 23, 2026 17:1135,272326,292,245290,763,0001,998,0002,277,376
8Feb 23, 2026 17:1135,273321,833,810291,766,000999,0002,400,256
9Feb 23, 2026 17:1135,282318,804,263291,841,000999,0002,277,376