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 3, 2025 12:12AntonAntonScore: 67,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2025 12:1267,898592,151,334520,588,00042,966,0002,293,760
2Nov 3, 2025 12:1267,924589,030,652499,793,00063,973,0002,297,856
3Nov 3, 2025 12:1267,927591,035,496515,813,00047,982,0002,301,952
4Nov 3, 2025 12:1267,928599,075,155500,826,00062,978,0002,543,616
5Nov 3, 2025 12:1267,939591,915,925497,907,00065,987,0002,543,616
6Nov 3, 2025 12:1267,944593,057,831506,945,00056,993,0002,293,760
7Nov 3, 2025 12:1267,954587,699,240528,021,00036,001,0002,543,616
8Nov 3, 2025 12:1267,964586,670,201518,094,00046,008,0002,408,448
9Nov 3, 2025 12:1267,981591,650,922510,219,00054,023,0002,297,856