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 18, 2026 15:49Yuriy LyfenkoYuriy LyfenkoScore: 4,295Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 15:504,28758,184,38434,566,0001,016,0002,310,144
2Apr 18, 2026 15:494,28966,901,47734,582,0001,017,0002,535,424
3Apr 18, 2026 15:504,29167,422,15834,596,0001,017,0002,535,424
4Apr 18, 2026 15:504,29560,410,68334,631,0001,018,0002,482,176
5Apr 18, 2026 15:494,29667,484,74334,636,0001,018,0002,535,424
6Apr 18, 2026 15:494,31858,417,32733,851,0001,991,0002,297,856