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 19:46Eric CeglieEric CeglieScore: 9,200Success
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 19:469,109103,686,05771,572,0004,032,0002,465,792
2Mar 15, 2026 19:469,111100,518,26073,602,0002,016,0002,310,144
3Mar 15, 2026 19:469,114100,020,88573,631,0002,017,0002,473,984
4Mar 15, 2026 19:469,126105,160,51871,763,0003,986,0002,490,368
5Mar 15, 2026 19:469,20099,418,73773,343,0003,014,0002,469,888
6Mar 15, 2026 19:469,208101,102,27672,402,0004,022,0002,506,752
7Mar 15, 2026 19:469,217103,574,56175,497,0001,006,0002,277,376
8Mar 15, 2026 19:469,229101,657,22172,568,0004,031,0002,498,560
9Mar 15, 2026 19:469,252106,698,16072,806,0003,989,0002,355,200