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 listMay 11, 2026 06:47wnwnScore: 3,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 06:473,28634,570,30427,274,00002,113,536
2May 11, 2026 06:473,28634,827,48727,277,00002,113,536
3May 11, 2026 06:473,31534,777,38727,522,00002,113,536
4May 11, 2026 06:473,35537,159,49727,854,00002,113,536
5May 11, 2026 06:473,37936,568,84727,024,0001,023,0002,113,536
6May 11, 2026 06:473,38135,311,29226,930,0001,140,0002,113,536
7May 11, 2026 06:473,38638,317,34828,110,00002,113,536
8May 11, 2026 06:473,43838,033,14928,538,00002,113,536
9May 11, 2026 06:473,47038,690,46028,802,00002,113,536