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 listOct 24, 2026 06:16Nao MinamiNao MinamiScore: 18,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2026 06:1718,219162,094,656150,064,0001,158,0002,113,536
2Oct 24, 2026 06:1718,264162,599,001150,355,0001,240,0002,113,536
3Oct 24, 2026 06:1718,268162,589,129150,370,0001,258,0002,113,536
4Oct 24, 2026 06:1718,276162,737,047150,437,0001,255,0002,113,536
5Oct 24, 2026 06:1718,279162,624,498150,550,0001,167,0002,113,536
6Oct 24, 2026 06:1718,280162,681,489150,655,0001,072,0002,113,536
7Oct 24, 2026 06:1718,280162,637,614150,553,0001,175,0002,113,536
8Oct 24, 2026 06:1718,293164,141,983150,835,0001,005,0002,113,536
9Oct 24, 2026 06:1718,311162,949,022150,755,0001,234,0002,113,536