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 11, 2026 07:53C#_userC#_userScore: 45,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 07:5345,319384,837,323375,149,0001,003,0002,117,632
2Sep 11, 2026 07:5345,324386,269,229375,189,0001,005,0002,117,632
3Sep 11, 2026 07:5345,324384,817,762375,190,0001,002,0002,117,632
4Sep 11, 2026 07:5345,330385,009,705375,235,0001,004,0002,117,632
5Sep 11, 2026 07:5345,343385,087,581375,350,0001,004,0002,117,632
6Sep 11, 2026 07:5345,343385,093,707375,348,0001,003,0002,117,632
7Sep 11, 2026 07:5345,345385,782,939375,366,0001,005,0002,117,632
8Sep 11, 2026 07:5345,348386,833,123375,392,0001,003,0002,117,632
9Sep 11, 2026 07:5345,357385,272,986375,465,0001,004,0002,117,632