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 5, 2026 13:33Mohamed Elmahdi BendimeradMohamed Elmahdi BendimeradScore: 78,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 13:3378,703667,636,760591,350,00061,889,0002,351,104
2May 5, 2026 13:3378,759670,490,069590,918,00062,788,0002,347,008
3May 5, 2026 13:3378,801668,966,369591,731,00062,318,0002,351,104
4May 5, 2026 13:3378,807672,358,419590,984,00063,115,0002,347,008
5May 5, 2026 13:3378,875673,591,516590,840,00063,827,0002,347,008
6May 5, 2026 13:3378,906673,021,497591,075,00063,849,0002,338,816
7May 5, 2026 13:3378,970673,413,710590,943,00064,511,0002,347,008
8May 5, 2026 13:3378,977673,761,307591,010,00064,506,0002,351,104
9May 5, 2026 13:3379,017674,962,385591,258,00064,586,0002,359,296