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 27, 2026 14:42SabadonSabadonScore: 235,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 14:42234,9931,975,498,1181,888,463,00061,982,0002,498,560
2Mar 27, 2026 14:42235,3331,979,994,7051,906,282,00046,982,0002,322,432
3Mar 27, 2026 14:42235,4271,981,846,8101,892,076,00061,969,0002,326,528
4Mar 27, 2026 14:42235,4681,982,969,7741,903,401,00050,983,0002,375,680
5Mar 27, 2026 14:42235,7251,984,051,2101,896,530,00059,985,0002,371,584
6Mar 27, 2026 14:42235,7651,985,632,1621,903,880,00052,968,0002,322,432
7Mar 27, 2026 14:42235,7711,985,938,0261,903,931,00052,970,0002,326,528
8Mar 27, 2026 14:42235,8201,988,848,7181,906,321,00050,981,0002,322,432
9Mar 27, 2026 14:42235,8561,986,854,0561,898,648,00058,958,0002,375,680