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 14, 2026 13:32Yuriy LyfenkoYuriy LyfenkoScore: 2,106,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 13:302,105,28417,504,782,16417,374,904,00098,953,0002,277,376
2Mar 14, 2026 13:302,105,46917,503,904,08817,353,445,000121,946,0002,277,376
3Mar 14, 2026 13:322,105,66317,510,010,03717,400,043,00076,960,0002,277,376
4Mar 14, 2026 13:302,106,56017,513,541,21317,427,471,00056,978,0002,277,376
5Mar 14, 2026 13:322,106,56917,517,204,75717,411,553,00072,968,0002,277,376
6Mar 14, 2026 13:322,106,98417,516,736,02317,427,994,00059,975,0002,281,472