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 listJan 7, 2026 13:07Pavel SkripkinPavel SkripkinScore: 80,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 13:0779,773692,640,596428,429,000233,689,0002,371,584
2Jan 7, 2026 13:0779,784685,402,070428,488,000233,720,0002,330,624
3Jan 7, 2026 13:0779,788693,795,518429,508,000232,733,0002,342,912
4Jan 7, 2026 13:0779,842687,985,642428,801,000233,891,0002,469,888
5Jan 7, 2026 13:0780,200691,307,783429,779,000235,879,0002,301,952
6Jan 7, 2026 13:0780,459690,591,748428,877,000238,931,0002,306,048
7Jan 7, 2026 13:0781,338701,449,645442,416,000232,693,0002,482,176
8Jan 7, 2026 13:0781,428703,237,785443,901,000231,948,0002,387,968
9Jan 7, 2026 13:0781,924710,691,540444,325,000235,642,0002,510,848