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 listNov 2, 2025 16:38triscacezar-droidtriscacezar-droidScore: 69,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2025 16:3869,021595,634,566514,886,00057,987,0002,371,584
2Nov 2, 2025 16:3869,082602,490,257509,452,00063,931,0002,273,280
3Nov 2, 2025 16:3869,099598,519,121514,574,00058,951,0002,273,280
4Nov 2, 2025 16:3869,159596,780,870519,015,00055,001,0002,383,872
5Nov 2, 2025 16:3869,214603,504,351509,538,00064,941,0002,371,584
6Nov 2, 2025 16:3869,220600,610,026512,574,00061,948,0002,273,280
7Nov 2, 2025 16:3869,229604,767,911514,646,00059,958,0002,375,680
8Nov 2, 2025 16:3869,251597,250,150515,804,00058,977,0002,273,280
9Nov 2, 2025 16:3869,299602,735,520503,162,00072,023,0002,379,776