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 listOct 23, 2025 20:08caandocaandoScore: 6,169Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2025 20:086,00375,218,11847,833,0001,993,0002,510,848
2Oct 23, 2025 20:086,10080,468,45850,630,00002,273,280
3Oct 23, 2025 20:086,12473,398,70649,832,000996,0002,269,184
4Oct 23, 2025 20:086,16975,974,05149,193,0002,007,0002,392,064
5Oct 23, 2025 20:086,25275,795,20850,895,000997,0002,519,040
6Oct 23, 2025 20:086,25277,200,08849,899,0001,995,0002,269,184