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 listJun 26, 2026 08:47Victor MerckléVictor MerckléScore: 8,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 08:494,87748,098,95239,376,0001,107,0002,117,632stderr
2Jun 26, 2026 08:494,90348,272,22739,639,0001,056,0002,117,632stderr
3Jun 26, 2026 08:494,92848,369,13639,871,0001,032,0002,117,632stderr
4Jun 26, 2026 08:494,95448,729,88840,003,0001,123,0002,117,632stderr
5Jun 26, 2026 08:498,86781,269,39172,458,0001,141,0002,117,632stderr
6Jun 26, 2026 08:498,90181,437,65872,745,0001,138,0002,117,632stderr
7Jun 26, 2026 08:498,91081,627,84572,819,0001,139,0002,117,632stderr
8Jun 26, 2026 08:498,91583,766,36672,830,0001,171,0002,117,632stderr
9Jun 26, 2026 08:499,14883,467,18474,864,0001,067,0002,117,632stderr