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 listMar 29, 2026 07:46Danylo MocherniukDanylo MocherniukScore: 68,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 07:4668,476593,840,912516,321,00052,032,0002,510,848
2Mar 29, 2026 07:4668,485595,676,365507,379,00061,045,0002,506,752
3Mar 29, 2026 07:4668,508594,805,894511,652,00056,961,0002,510,848
4Mar 29, 2026 07:4668,537592,379,613509,869,00058,984,0002,293,760
5Mar 29, 2026 07:4668,542595,945,385507,912,00060,989,0002,285,568
6Mar 29, 2026 07:4668,569591,064,767513,111,00056,012,0002,293,760
7Mar 29, 2026 07:4668,590599,293,891510,374,00058,927,0002,293,760
8Mar 29, 2026 07:4668,703605,439,205512,209,00058,023,0002,506,752
9Mar 29, 2026 07:4668,824598,432,771500,213,00071,030,0002,519,040