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 10, 2026 16:03Victor MerckléVictor MerckléScore: 6,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 16:036,09259,286,52848,512,0002,052,0002,113,536
2Jun 10, 2026 16:036,10058,256,97348,600,0002,031,0002,113,536
3Jun 10, 2026 16:036,10558,316,46448,670,0002,004,0002,113,536
4Jun 10, 2026 16:036,11258,260,86448,615,0002,117,0002,113,536
5Jun 10, 2026 16:036,12658,695,08448,824,0002,026,0002,113,536
6Jun 10, 2026 16:036,15058,666,94249,020,0002,032,0002,113,536
7Jun 10, 2026 16:036,16359,062,86250,123,0001,030,0002,113,536
8Jun 10, 2026 16:036,17558,819,58949,226,0002,027,0002,113,536
9Jun 10, 2026 16:036,17658,805,58150,230,0001,036,0002,113,536