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 17, 2026 14:59Yuriy LyfenkoYuriy LyfenkoScore: 8,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 14:588,49195,867,98859,401,00011,074,0002,367,488
2Mar 17, 2026 14:588,513103,934,52462,580,0008,074,0002,482,176
3Mar 17, 2026 14:598,52795,867,75864,793,0005,980,0002,482,176
4Mar 17, 2026 14:588,531100,110,14659,835,00010,969,0002,519,040
5Mar 17, 2026 14:598,53597,640,61862,857,0007,981,0002,486,272
6Mar 17, 2026 14:598,54597,450,43160,936,0009,989,0002,277,376