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 09:26Victor MerckléVictor MerckléScore: 4,169Success
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 09:274,13742,040,18433,249,0001,089,0002,113,536
2Jun 26, 2026 09:274,15242,130,46433,467,0001,002,0002,113,536
3Jun 26, 2026 09:274,15842,260,58333,499,0001,020,0002,113,536
4Jun 26, 2026 09:274,16042,209,84733,436,0001,099,0002,113,536
5Jun 26, 2026 09:274,16942,285,22033,594,0001,016,0002,113,536
6Jun 26, 2026 09:274,17042,333,00333,583,0001,032,0002,113,536
7Jun 26, 2026 09:274,18742,422,76333,755,0001,003,0002,113,536
8Jun 26, 2026 09:274,21542,637,64933,899,0001,089,0002,113,536
9Jun 26, 2026 09:274,29043,242,37834,579,0001,031,0002,113,536