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 20, 2026 05:19M-RochatM-RochatScore: 63,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:2263,413535,494,506462,648,00063,684,0002,129,920
2May 20, 2026 05:2263,512536,390,509464,015,00063,141,0002,129,920
3May 20, 2026 05:2263,513536,905,684463,391,00063,767,0002,129,920
4May 20, 2026 05:2263,525536,367,453463,340,00063,918,0002,129,920
5May 20, 2026 05:2263,559536,644,743463,364,00064,176,0002,170,880
6May 20, 2026 05:2263,562536,775,924463,430,00064,136,0002,129,920
7May 20, 2026 05:2263,569538,313,685462,803,00064,821,0002,129,920
8May 20, 2026 05:2263,617537,201,134464,081,00063,946,0002,129,920
9May 20, 2026 05:2263,666537,840,132463,693,00064,735,0002,129,920