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 listApr 4, 2026 17:41Danylo MocherniukDanylo MocherniukScore: 6,563Success
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 22:366,52475,523,57352,144,0002,005,0002,293,760
2Apr 4, 2026 17:416,52778,789,32752,172,0002,006,0002,293,760
3Mar 29, 2026 22:366,53080,888,25352,193,0002,007,0002,510,848
4Mar 29, 2026 22:366,54878,852,77152,334,0002,012,0002,293,760
5Mar 29, 2026 22:366,56076,776,94053,443,0001,008,0002,293,760
6Mar 29, 2026 22:366,56183,503,84054,455,00002,506,752
7Mar 29, 2026 22:366,56371,399,37053,465,0001,008,0002,506,752
8Mar 29, 2026 22:366,56778,638,00054,510,00002,506,752
9Mar 29, 2026 22:366,57581,538,76453,562,0001,010,0002,510,848
10Apr 4, 2026 17:416,60582,217,00552,831,0001,993,0002,498,560
11Mar 29, 2026 22:366,60879,203,12853,853,000997,0002,502,656
12Apr 4, 2026 17:416,60981,182,71352,864,0001,994,0002,506,752