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:34triscacezar-droidtriscacezar-droidScore: 69,103Success
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:3468,937595,219,723512,156,00060,018,0002,498,560
2Nov 2, 2025 16:3468,995599,671,804519,694,00052,968,0002,273,280
3Nov 2, 2025 16:3469,052594,848,269507,118,00066,015,0002,273,280
4Nov 2, 2025 16:3469,068596,953,493513,237,00060,027,0002,502,656
5Nov 2, 2025 16:3469,103600,425,635514,601,00058,954,0002,383,872
6Nov 2, 2025 16:3469,154596,807,045515,980,00057,997,0002,383,872
7Nov 2, 2025 16:3469,165595,810,012510,065,00064,008,0002,273,280
8Nov 2, 2025 16:3469,247597,874,539507,779,00066,970,0002,379,776
9Nov 2, 2025 16:3469,356600,178,671516,687,00058,964,0002,273,280