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,168Success
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,010598,263,225515,804,00056,978,0002,273,280
2Nov 2, 2025 16:3869,074602,692,968515,282,00058,031,0002,273,280
3Nov 2, 2025 16:3869,097599,621,516511,562,00061,947,0002,387,968
4Nov 2, 2025 16:3869,164599,088,335513,053,00061,006,0002,273,280
5Nov 2, 2025 16:3869,168597,062,215518,086,00056,009,0002,273,280
6Nov 2, 2025 16:3869,218603,183,816508,567,00065,943,0002,273,280
7Nov 2, 2025 16:3869,234597,387,802508,686,00065,959,0002,273,280
8Nov 2, 2025 16:3869,281601,083,373518,033,00057,003,0002,273,280
9Nov 2, 2025 16:3869,341602,631,615513,584,00061,949,0002,375,680