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 5, 2026 15:25M-RochatM-RochatScore: 95,848Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 15:2595,762811,549,309731,109,00063,718,0002,375,680
2May 5, 2026 15:2595,803812,323,693731,618,00063,552,0002,375,680
3May 5, 2026 15:2595,812814,140,923731,861,00063,379,0002,379,776
4May 5, 2026 15:2595,847814,913,599731,366,00064,166,0002,383,872
5May 5, 2026 15:2595,848811,755,876731,516,00064,030,0002,367,488
6May 5, 2026 15:2595,874814,709,547731,732,00064,025,0002,367,488
7May 5, 2026 15:2595,901811,035,190731,097,00064,888,0002,383,872
8May 5, 2026 15:2595,949813,489,202731,560,00064,821,0002,383,872
9May 5, 2026 15:2595,970813,296,645731,549,00065,005,0002,314,240