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 listSep 30, 2026 19:51Karthik ReddyKarthik ReddyScore: 49,936Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2026 19:5249,922423,979,248413,351,0001,004,0002,113,536
2Sep 30, 2026 19:5249,928423,334,326413,281,0001,123,0002,113,536
3Sep 30, 2026 19:5249,929423,318,738413,354,0001,064,0002,113,536
4Sep 30, 2026 19:5249,931423,397,435413,370,0001,062,0002,113,536
5Sep 30, 2026 19:5249,936423,490,669413,432,0001,038,0002,113,536
6Sep 30, 2026 19:5249,943423,490,485413,429,0001,103,0002,113,536
7Sep 30, 2026 19:5249,950423,554,227413,566,0001,026,0002,113,536
8Sep 30, 2026 19:5249,950423,498,074413,483,0001,107,0002,113,536
9Sep 30, 2026 19:5249,955423,585,811413,550,0001,084,0002,113,536