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 14:19eldon-chungeldon-chungScore: 36,231Success
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 14:1936,168326,709,663299,198,0001,000,0002,285,568
2Mar 15, 2026 14:1936,186325,603,518299,342,0001,001,0002,285,568
3Mar 15, 2026 14:1936,201329,707,531300,467,00002,273,280
4Mar 15, 2026 14:1936,209332,370,322299,537,0001,001,0002,265,088
5Mar 15, 2026 14:1936,231334,015,251300,718,00002,285,568
6Mar 15, 2026 14:1936,433329,079,983300,392,0002,002,0002,285,568
7Mar 15, 2026 14:1936,588330,249,000301,681,0001,997,0002,273,280
8Mar 15, 2026 14:1936,592328,893,460302,715,0001,002,0002,285,568
9Mar 15, 2026 14:1936,613326,970,915302,891,000999,0002,285,568