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 21, 2026 10:10BenBenScore: 23,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 10:1023,503228,605,508186,076,0009,003,0002,322,432
2Apr 21, 2026 10:1023,515223,565,105186,167,0009,008,0002,326,528
3Apr 21, 2026 10:1023,568221,160,361186,638,0008,982,0002,330,624
4Apr 21, 2026 10:1023,597219,611,305182,868,00012,990,0002,277,376
5Apr 21, 2026 10:1023,656209,573,512187,336,0009,016,0002,269,184
6Apr 21, 2026 10:1023,732220,523,747187,980,0008,999,0002,322,432
7Apr 21, 2026 10:1023,754223,544,937189,153,0008,006,0002,465,792
8Apr 21, 2026 10:1023,762224,604,703188,215,0009,010,0002,326,528
9Apr 21, 2026 10:1023,775218,306,413192,326,0005,008,0002,326,528