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:39triscacezar-droidtriscacezar-droidScore: 69,057Success
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:3968,982595,951,229518,595,00053,957,0002,273,280
2Nov 2, 2025 16:3969,029602,895,583530,949,00041,995,0002,273,280
3Nov 2, 2025 16:3969,039596,661,226519,025,00054,002,0002,273,280
4Nov 2, 2025 16:3969,039600,064,561511,022,00062,002,0002,273,280
5Nov 2, 2025 16:3969,057596,439,438534,160,00039,011,0002,273,280
6Nov 2, 2025 16:3969,057598,308,232512,153,00061,018,0002,273,280
7Nov 2, 2025 16:3969,083603,146,313519,350,00054,036,0002,379,776
8Nov 2, 2025 16:3969,109601,443,377503,656,00069,952,0002,273,280
9Nov 2, 2025 16:3969,330602,799,254504,509,00070,930,0002,273,280