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 18, 2026 15:54shartgepettoshartgepettoScore: 6,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 15:546,00075,211,06547,812,0001,992,0002,457,600
2Mar 18, 2026 15:546,00675,936,98644,866,0004,985,0002,482,176
3Mar 18, 2026 15:546,00771,781,25247,860,0001,994,0002,367,488
4Mar 18, 2026 15:546,00974,701,98145,888,0003,990,0002,408,448
5Mar 18, 2026 15:546,01174,317,57446,897,0002,993,0002,269,184
6Mar 18, 2026 15:546,01368,674,74747,909,0001,996,0002,473,984
7Mar 18, 2026 15:546,08778,359,85248,545,0001,981,0002,367,488
8Mar 18, 2026 15:546,12478,127,26347,838,0002,989,0002,478,080
9Mar 18, 2026 15:546,16376,638,61247,145,0004,012,0002,457,600