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 listAug 10, 2026 21:28Lan Hoang DaoLan Hoang DaoScore: 62,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 21:2862,577530,152,024460,890,00058,506,0002,113,536
2Aug 10, 2026 21:2862,578529,908,928460,807,00058,598,0002,113,536
3Aug 10, 2026 21:2862,591529,502,345461,878,00057,628,0002,113,536
4Aug 10, 2026 21:2862,595530,297,226460,819,00058,724,0002,113,536
5Aug 10, 2026 21:2862,608529,664,775460,702,00058,949,0002,113,536
6Aug 10, 2026 21:2862,616529,783,530461,658,00058,055,0002,113,536
7Aug 10, 2026 21:2862,624529,917,294461,696,00058,091,0002,113,536
8Aug 10, 2026 21:2862,670530,179,587461,613,00058,554,0002,113,536
9Aug 10, 2026 21:2862,677531,033,895461,012,00059,210,0002,113,536