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 listMar 18, 2026 20:25Joel SmithJoel SmithScore: 90,512Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 20:2590,496779,007,666750,116,0001,000,0002,273,280
2Mar 18, 2026 20:2590,497779,971,792750,124,0001,000,0002,277,376
3Mar 18, 2026 20:2590,498773,199,166750,137,0001,000,0002,273,280
4Mar 18, 2026 20:2590,510776,385,140750,230,0001,000,0002,273,280
5Mar 18, 2026 20:2590,512777,292,992750,253,0001,000,0002,273,280
6Mar 18, 2026 20:2590,524783,610,951751,351,00002,273,280
7Mar 18, 2026 20:2590,530778,494,872750,402,000999,0002,260,992
8Mar 18, 2026 20:2590,535779,749,415749,439,0001,998,0002,273,280
9Mar 18, 2026 20:2590,535783,045,019750,441,000999,0002,273,280