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 15, 2026 02:47tqbfjotld-0tqbfjotld-0Score: 52,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 02:4752,258459,575,723431,747,0001,998,0002,285,568
2Mar 15, 2026 02:4752,289457,533,569432,002,0002,000,0002,285,568
3Mar 15, 2026 02:4752,309457,181,157434,163,00002,289,664
4Mar 15, 2026 02:5552,332460,509,011434,358,00002,285,568
5Mar 15, 2026 02:4752,338462,457,075433,403,0001,000,0002,285,568
6Mar 15, 2026 02:4752,343463,911,326433,445,0001,001,0002,285,568
7Mar 15, 2026 02:5552,343466,195,203433,442,0001,001,0002,285,568
8Mar 15, 2026 02:4752,360457,311,109432,594,0001,998,0002,273,280
9Mar 15, 2026 02:4752,365460,431,348432,629,0001,998,0002,269,184
10Mar 15, 2026 02:4752,386458,802,525433,804,000999,0002,285,568
11Mar 15, 2026 02:5552,386454,056,939432,802,0001,999,0002,277,376
12Mar 15, 2026 02:4752,407458,125,656433,975,000999,0002,277,376