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 listFeb 24, 2026 18:56Mikołaj UzarskiMikołaj UzarskiScore: 5,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 18:565,67871,664,75442,112,0005,013,0002,445,312
2Feb 24, 2026 18:565,70370,904,18839,275,0008,056,0002,314,240
3Feb 24, 2026 18:565,76974,685,32741,901,0005,985,0002,306,048