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 listMay 4, 2026 21:10M-RochatM-RochatScore: 36,112Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 21:1035,870314,442,996296,716,0001,007,0002,375,680
2May 4, 2026 21:1035,891311,824,059296,895,0001,004,0002,371,584
3May 4, 2026 21:1036,066319,430,384298,350,0001,005,0002,387,968
4May 4, 2026 21:1036,101318,456,966298,632,0001,009,0002,383,872
5May 4, 2026 21:1036,112316,271,930298,724,0001,007,0002,375,680
6May 4, 2026 21:1036,454321,172,886301,565,0001,006,0002,379,776
7May 4, 2026 21:1036,456319,179,820301,579,0001,007,0002,375,680
8May 4, 2026 21:1036,483321,309,459301,808,0001,006,0002,375,680
9May 4, 2026 21:1036,484320,719,821301,816,0001,005,0002,371,584