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 listAug 27, 2026 03:20Victor MerckléVictor MerckléScore: 4,187Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 03:214,10742,416,91633,001,0001,095,0002,113,536
2Aug 27, 2026 03:214,10842,418,57532,999,0001,104,0002,113,536
3Aug 27, 2026 03:214,11142,469,96433,095,0001,034,0002,113,536
4Aug 27, 2026 03:214,11842,343,56733,091,0001,093,0002,113,536
5Aug 27, 2026 03:214,18743,306,30033,692,0001,063,0002,113,536
6Aug 27, 2026 03:214,27443,589,68134,429,0001,049,0002,113,536
7Aug 27, 2026 03:214,28743,848,04434,527,0001,060,0002,113,536
8Aug 27, 2026 03:214,30544,787,30134,680,0001,056,0002,113,536
9Aug 27, 2026 03:214,31244,008,08434,747,0001,050,0002,113,536