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 23, 2025 16:56j3o1j3o1Score: 75,450Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2025 16:5672,354630,655,932598,541,0001,998,0002,527,232
2Nov 23, 2025 16:5675,450656,090,112626,238,00002,523,136
3Nov 23, 2025 16:5675,450654,420,835625,234,0001,000,0002,269,184