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 04:55Victor MerckléVictor MerckléScore: 5,004Success
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 04:574,99349,302,87940,327,0001,118,0002,113,536
2Jun 26, 2026 04:574,99849,049,66440,362,0001,126,0002,113,536
3Jun 26, 2026 04:575,00049,484,28340,377,0001,126,0002,113,536
4Jun 26, 2026 04:575,00349,660,30440,386,0001,143,0002,113,536
5Jun 26, 2026 04:575,00449,061,09840,451,0001,089,0002,113,536
6Jun 26, 2026 04:575,01249,067,44940,484,0001,116,0002,113,536
7Jun 26, 2026 04:575,01249,100,96140,509,0001,092,0002,113,536
8Jun 26, 2026 04:575,01849,314,81740,535,0001,117,0002,113,536
9Jun 26, 2026 04:575,05049,759,32340,782,0001,141,0002,113,536