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 listApr 27, 2026 15:38Victor MerckléVictor MerckléScore: 33,506Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 15:3933,457296,099,832276,696,0001,002,0002,326,528
2Apr 27, 2026 15:3933,458295,059,081275,712,0001,997,0002,363,392
3Apr 27, 2026 15:3933,466297,006,542273,776,0003,996,0002,375,680
4Apr 27, 2026 15:3933,505294,768,078277,095,0001,000,0002,379,776
5Apr 27, 2026 15:3933,506296,512,470277,105,0001,000,0002,392,064
6Apr 27, 2026 15:3933,569297,344,420276,626,0002,004,0002,375,680
7Apr 27, 2026 15:3933,593292,750,185276,826,0001,998,0002,482,176
8Apr 27, 2026 15:3933,605298,845,960277,926,000999,0002,383,872
9Apr 27, 2026 15:3933,611295,769,033276,976,0001,999,0002,363,392