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 28, 2026 13:00Innokentii MeleshchenkoInnokentii MeleshchenkoScore: 249,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 28, 2026 13:00247,8512,069,009,7831,992,917,00064,248,0002,117,632
2May 28, 2026 13:00248,1702,071,116,3091,996,749,00063,066,0002,117,632
3May 28, 2026 13:00248,8082,077,701,2422,000,064,00065,047,0002,117,632
4May 28, 2026 13:00249,1552,079,409,9872,003,934,00064,056,0002,117,632
5May 28, 2026 13:00249,5962,083,909,0812,008,574,00063,074,0002,117,632
6May 28, 2026 13:00249,6662,082,683,4912,007,994,00064,235,0002,117,632
7May 28, 2026 13:00250,3402,087,643,0882,014,762,00063,068,0002,117,632
8May 28, 2026 13:00250,4512,089,503,5372,014,663,00064,083,0002,117,632
9May 28, 2026 13:00257,9742,150,902,2502,073,006,00068,185,0002,117,632