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 7, 2026 17:16Benn TanBenn TanScore: 71,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 17:1671,181620,771,301588,803,0001,999,0002,387,968
2Feb 7, 2026 17:1671,209612,729,319591,035,00002,273,280
3Feb 7, 2026 17:1671,246625,081,706591,339,00002,269,184